Перевод: со всех языков на русский

с русского на все языки

Poisson arrival

См. также в других словарях:

  • Poisson process — A Poisson process, named after the French mathematician Siméon Denis Poisson (1781 ndash; 1840), is the stochastic process in which events occur continuously and independently of one another (the word event used here is not an instance of the… …   Wikipedia

  • Arrival theorem — In queueing theory, a discipline within the mathematical theory of probability, the arrival theorem[1] (also referred to as the random observer property, ROP or job observer property[2]) states the state of a system immediately before an arrival… …   Wikipedia

  • Poisson regression — In statistics, Poisson regression is a form of regression analysis used to model count data and contingency tables. Poisson regression assumes the response variable Y has a Poisson distribution, and assumes the logarithm of its expected value can …   Wikipedia

  • Markovian arrival processes — In queueing theory, Markovian arrival processes are used to model the arrival of customers to a queue. Some of the most common include the Poisson process, Markov arrival process and the batch Markov arrival process. Contents 1 Background 2… …   Wikipedia

  • Non-homogeneous Poisson process — In probability theory, a non homogeneous Poisson process is a Poisson process with rate parameter λ(t) such that the rate parameter of the process is a function of time.[1] Non homogeneous Poisson process have been shown to describe numerous… …   Wikipedia

  • Continuous-time Markov process — In probability theory, a continuous time Markov process is a stochastic process { X(t) : t ≥ 0 } that satisfies the Markov property and takes values from a set called the state space; it is the continuous time version of a Markov chain. The… …   Wikipedia

  • Engset calculation — The Engset calculation is a formula to determine the probability of congestion occurring within a telephony circuit group. It was named after its developer, T. O. Engset. The level of congestion can be used to determine a network s performance as …   Wikipedia

  • Longest increasing subsequence — The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not… …   Wikipedia

  • Exponential distribution — Not to be confused with the exponential families of probability distributions. Exponential Probability density function Cumulative distribution function para …   Wikipedia

  • Queueing theory — is the mathematical study of waiting lines (or s ). The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served by… …   Wikipedia

  • Queueing model — In queueing theory, a queueing model is used to approximate a real queueing situation or system, so the queueing behaviour can be analysed mathematically. Queueing models allow a number of useful steady state performance measures to be determined …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»